On multiplicative conditionally free convolution
نویسندگان
چکیده
منابع مشابه
Probability MULTIPLICATIVE FREE CONVOLUTION AND INFORMATION - PLUS - NOISE TYPE MATRICES
Free probability and random matrix theory has shown to be a fruitful combination in many fields of research, such as digital communications, nuclear physics and mathematical finance. The link between free probability and eigenvalue distributions of random matrices will be strengthened further in this paper. It will be shown how the concept of multiplicative free convolution can be used to expre...
متن کاملSpectral density of generalized Wishart matrices and free multiplicative convolution.
We investigate the level density for several ensembles of positive random matrices of a Wishart-like structure, W=XX(†), where X stands for a non-Hermitian random matrix. In particular, making use of the Cauchy transform, we study the free multiplicative powers of the Marchenko-Pastur (MP) distribution, MP(⊠s), which for an integer s yield Fuss-Catalan distributions corresponding to a product o...
متن کاملOn a remarkable semigroup of homomorphisms with respect to free multiplicative convolution
Let M denote the space of Borel probability measures on R. For every t ≥ 0 we consider the transformation Bt : M → M defined by Bt(μ) = ( μ )⊎(1/(1+t)) , μ ∈ M, where ⊞ and ⊎ are the operations of free additive convolution and respectively of Boolean convolution on M, and where the convolution powers with respect to ⊞ and ⊎ are defined in the natural way. We show that Bs ◦ Bt = Bs+t, ∀ s, t ≥ 0...
متن کاملMultiplicative Measures on Free Groups
The present paper is motivated by needs of practical computations in finitely presented groups. In particular, we wish to develop tools which can be used in the analysis of the “practical” complexity of algorithmic problems for discrete infinite groups, as well as in the analysis of the behaviour of heuristic (e.g. genetic) algorithms for infinite groups [22, 23]. In most computer-based computa...
متن کاملMultiplicative complexity, convolution, and the DFT
Well, someone can decide by themselves what they want to do and need to do but sometimes, that kind of person will need some multiplicative complexity convolution and the dft references. People with open minded will always try to seek for the new things and information from many sources. On the contrary, people with closed mind will always think that they can do it by their principals. So, what...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2011
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-2011-05242-6